Noncommutative Extensions of the Fourier Transform and Its Logarithm
نویسنده
چکیده
We introduce noncommutative extensions of the Fourier transform of probability measures and its logarithm in the algebra A(S) of complex-valued functions on the free semigroup on two generators S = FS({z,w}). First, to given probability measures μ, ν whose all moments are finite, we associate states μ̂, ν̂ on the unital free *-bialgebra (B, ǫ,∆) on two self-adjoint generators X,X ′ and a projection P . Then we introduce and study cumulants which are additive under the convolution μ̂ ⋆ ν̂ = μ̂⊗ ν̂ ◦∆ when restricted to the “noncommutative plane” B0 = C〈X,X ′〉. We find a combinatorial formula for the Möbius function in the inversion formula and define the moment and cumulant generating functions, Mμ̂{z,w} and Lμ̂{z,w}, respectively, as elements of A(S). When restricted to the subsemigroups FS({z}) and FS({w}), the function Lμ̂{z,w} coincides with the logarithm of the Fourier transform and with the K-transform of μ, respectively. In turn, Mμ̂{z,w} is a “semigroup interpolation” between the Fourier transform and the Cauchy transform of μ. By choosing a suitable weight function W on the semigroup S, the moment and cumulant generating functions become elements of the Banach algebra l1(S,W ). Mathematics Subject Classification (2000): Primary 46L53, 60E10, 43A20; Secondary 06A07, 81R50
منابع مشابه
Projective Fourier Analysis in Computer Vision: Theory and Computer Simulations
Identifying the projective group for patterns by developing the camera model, the projective Fourier transform and its inverse are obtained in analogy with the classical, that is, Euclidean Fourier analysis. Projectively adapted properties are demonstrated in a numerical test. Using the expression of the projective Fourier integral by a standard Fourier integral in the coordinates given by the ...
متن کاملMulti-object tracking with representations of the symmetric group
We present an efficient algorithm for approximately maintaining and updating a distribution over permutations matching tracks to real world objects. The algorithm hinges on two insights from the theory of harmonic analysis on noncommutative groups. The first is that most of the information in the distribution over permutations is captured by certain “low frequency” Fourier components. The secon...
متن کاملWhy the Rotation Count Algorithm Works
The characteristic functions of many affine jump-diffusion models, such as Heston’s stochastic volatility model and all of its extensions, involve multivalued functions such as the complex logarithm. If we restrict the logarithm to its principal branch, as is done in most software packages, the characteristic function can become discontinuous, leading to completely wrong option prices if option...
متن کاملFormation interface detection using Gamma Ray log: A novel approach
There are two methods for identifying formation interface in oil wells: core analysis, which is a precise approach but costly and time consuming, and well logs analysis, which petrophysists perform, which is subjective and not completely reliable. In this paper, a novel coupled method was proposed to detect the formation interfaces using GR logs. Second approximation level (a2) of GR log gained...
متن کاملFractional Fourier Transform Based OFDMA for Doubly Dispersive Channels
The performance of Orthogonal Frequency Division Multiple Access (OFDMA) system degrades significantly in doubly dispersive channels. This is due to the fact that exponential sub-carriers do not match the singular functions of this type of channels. To solve this problem, we develop a system whose sub-carriers are chirp functions. This is equivalent to exploiting Fractional Fourier Transform (F...
متن کامل